A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers

We propose a ridesharing strategy with integrated transit in which a private on-demand mobility service operator may drop off a passenger directly door-to-door, commit to dropping them at a transit station or picking up from a transit station, or to both pickup and drop off at two different stations with different vehicles. We study the effectiveness of online solution algorithms for this proposed strategy. Queueing-theoretic vehicle dispatch and idle vehicle relocation algorithms are customized for the problem. Several experiments are conducted first with a synthetic instance to design and test the effectiveness of this integrated solution method, the influence of different model parameters, and measure the benefit of such cooperation. Results suggest that rideshare vehicle travel time can drop by 40-60% consistently while passenger journey times can be reduced by 50-60% when demand is high. A case study of Long Island commuters to New York City (NYC) suggests having the proposed operating strategy can substantially cut user journey times and operating costs by up to 54% and 60% each for a range of 10-30 taxis initiated per zone. This result shows that there are settings where such service is highly warranted

An integrated dynamic ridesharing dispatch and idle vehicle repositioning strategy on a bimodal transport network

In bimodal ridesharing, a private on-demand mobility service operator offers to drop off a passenger at a transit"br" station, where the passenger uses the transit network to get to another transit station, and the service operator"br" guarantees picking up the passenger to drop them off at the final destination. Such collaborations with public"br" transport agencies present a huge potential to increase the ridership. However, most existing studies on dynamic"br" dial-a-ride/ridesharing mainly focus on mono-modal cases only. We consider dynamic bimodal ridesharing"br" problems where real-time information is available to anticipate future demand. A new non-myopic vehicle"br" dispatching and routing policy based on queueing-theoretical approach is proposed and integrated with a nonmyopic"br" idle vehicle repositioning strategy to solve the problem. Several experiments are conducted to test the"br" effectiveness of this integrated solution method and measure the benefit of bimodal cooperation. The proposed"br" model and solution algorithm provides useful tools for real-time operating policy design of shared mobilit